Dynamic Scheduling Real-Time Task Using Primary-Backup Overloading Strategy for Multiprocessor Systems
نویسندگان
چکیده
منابع مشابه
Hybrid Overloading and Fault Tolerant Task Scheduling in Multiprocessor systems Based on Primary and Backup Scheme
With multiprocessor systems, redundant scheduling is a technique that trades processing power for increased reliability through redundancy. One approach, called primary-backup task scheduling, is often used in real-time multiprocessor systems to guarantee the deadlines of tasks in site of faults. Briefly, it consists in scheduling a secondary task conditionally in such a way that the secondary ...
متن کاملEfficient overloading techniques for primary-backup scheduling in real-time systems
In real-time systems, tasks have deadlines to be met despite the presence of faults. Primary-Backup (PB) scheme is one of the most important schemes that has been employed for fault-tolerant scheduling of real-time tasks, wherein each task has two versions and the versions are scheduled on two different processors with time exclusion. There have been techniques proposed for improving schedulabi...
متن کاملEnergy-Efficient Scheduling of Primary/Backup Tasks in Multiprocessor Real-Time Systems (Extended Version)
With the negative effects of the popular Dynamic Voltage and Frequency Scaling (DVFS) technique on transient faults being considered, the Primary/Backup approach has recently been exploited to save energy while preserving system reliability. In this paper, with the objectives of tolerating a single permanent fault and maintaining system reliability with respect to transient faults, we study ene...
متن کاملSoft Real-Time Fuzzy Task Scheduling for Multiprocessor Systems
All practical real-time scheduling algorithms in multiprocessor systems present a trade-off between their computational complexity and performance. In real-time systems, tasks have to be performed correctly and timely. Finding minimal schedule in multiprocessor systems with real-time constraints is shown to be NP-hard. Although some optimal algorithms have been employed in uni-processor systems...
متن کاملACO Based Dynamic Scheduling Algorithm for Real-Time Multiprocessor Systems
The Ant Colony Optimization (ACO) algorithms are computational models inspired by the collective foraging behavior of ants. The ACO algorithms provide inherent parallelism, which is very useful in multiprocessor environments. They provide balance between exploration and exploitation along with robustness and simplicity of individual agent. In this paper, ACO based dynamic scheduling algorithm f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2008
ISSN: 0916-8532,1745-1361
DOI: 10.1093/ietisy/e91-d.3.796